Maximal sets of triangle- factors
نویسندگان
چکیده
A collection of edge-disjoint triangle-factors on K3n is called maximal if it cannot be extended by a further triangle-factor. It is well-known that a maximal set must therefore contain at least % triangle factors. We consider the following question: for which k with % :::; k :::; (3n;1) is there a maximal set of k trianglefactors on K3n?
منابع مشابه
Some results on maximal open sets
In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.
متن کاملThe Triangle Closure is a Polyhedron
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with certain families of lattice-free sets are polyhedra. For a long time, the only result known was the celebrated theorem of Cook, Kannan and Schrijver who showe...
متن کاملThe Effect of Resistance Training with Two Maximum and Sub-maximal Intensities on Leukocytes and Blood Coagulation Factors in Non-Athlete Men: A Clinical Trial Study
Background and Objectives: The effects of maximal and sub-maximal resistance exercise on leukocytes and coagulator factors is ambiguous. Therefore the purpose of the present study was to determine the effect of maximum and sub-maximal resistance training intensities on leukocytes and blood coagulation factors in non-athlete men. Materials and Methods: In this clinical trial study,...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 9 شماره
صفحات -
تاریخ انتشار 1994